Wormhole Routing in De Bruijn Networks and Hyper-debruijn
نویسنده
چکیده
The order-(m,n) hyper-deBruijn graph H D ( m , n) is the direct product of an order-m hypercube and an order-n debruijn graph. The hyper-deBruijn graph offers flexibility in terms of connections per node and the level of fault-tolerance. These networks as well possess logarithmic diameter, simple routing algorithms and support many computationally imponant subgraphs and admit efficient implementation. In this paper, we present results on wormhole routing in binary de Bruijn and hyper-deBruijn networks. For an N-node binary de Bruijn network, four deadlock-free routing algorithms are presented. These algorithms use log N, r f log N I , [$ log NI and 4 virtual channels per physical channel. The number of hops needed to route a message using the above algorithms are 5 logN, 5 logN, S logN and 5 ZlogN, respectively. We present a generalized approach to design deadlock-free wormhole routing algorithms for the hyper-deBruijn networks. based on the above algorithms.
منابع مشابه
Wormhole routing in de Bruijn networks and hyper-de Bruijn networks
The order-(m, n) hyper-deBruijn graph HD(m,n) is the direct product of an order-m hypercube and an order-n debruijn graph. The hyper-deBruijn graph offers flexibility in terms of connections per node and the level of fault-tolerance. These networks as well possess logarithmic diameter, simple routing algorithms and support many computationally important subgraphs and admit efficient implementat...
متن کاملA Secure Routing Algorithm for Underwater Wireless Sensor Networks
Recently, underwater Wireless Sensor Networks (UWSNs) attracted the interest of many researchers and the past three decades have held the rapid progress of underwater acoustic communication. One of the major problems in UWSNs is how to transfer data from the mobile node to the base stations and choosing the optimized route for data transmission. Secure routing in UWSNs is necessary for packet d...
متن کاملMinimal, deadlock-free routing in hypercubic and arbitrary networks
In this paper we consider the problem of creating minimal, deadlock-free routing algorithms, where a routing algorithm is said to be minimal if it uses only shortest paths. In particular, we examine the possibility of creating scalable algorithms that use only a constant number of buuers per node. Minimal, scalable, deadlock-free routing algorithms are known for many important networks includin...
متن کاملHyper Butterfly Network: A Scalable Optimally Fault Tolerant Architecture
Bounded degree networks like deBruijn graphs or wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing nodes in the interconnection networks can have only a fixed number of I/O ports. One basic drawback of these networks is that they cannot provide a desired level of fault tolerance because of the bounded degree of th...
متن کاملA two-phase wormhole attack detection scheme in MANETs
Mobile ad-hoc networks (MANETs) have no fixed infrastructure, so all network operations such as routing and packet forwarding are done by the nodes themselves. However, almost all common existing routing protocols basically focus on performance measures regardless of security issues. Since these protocols consider all nodes to be trustworthy, they are prone to serious security threats. Wormhole...
متن کامل